Reflexive coloring complexes for 3-edge-colorings of cubic graphs

نویسندگان

چکیده

Given a 3-colorable graph X , the 3-coloring complex B ( ) is whose vertices are all independent sets which occur as color classes in some of . Two C D ∈ V joined by an edge if and appear together The 3-colorable. Graphs for isomorphic to termed reflexive graphs. In this paper, we consider 3-edge-colorings cubic graphs allow half-edges. Then complexes their line main result paper surprising outcome that any connected triangle-free outerplanar reflexive. We also exhibit other interesting

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Number of 3-Edge Colorings of Cubic Graphs

In this paper we present a short algebraic proof for a generalization of a formula of R. Penrose, Some applications of negative dimensional tensors, in: Combinatorial Mathematics and its Applications Welsh (ed.), Academic Press, 1971, pp. 221–244 on the number of 3-edge colorings of a plane cubic graph. We also show that the number of 3-edge colorings of cubic graphs can be computed (up to a fa...

متن کامل

Wei.ghts and Unique 3-Edge-Colorings of Cubic Graphs

Cun-Quan Zhang DEPARTMENT OF MATHEMA TICS WEST VIRGINIA UNIVERSITY MORGANTOWN, WEST VIRGINIA A (1,2)-eulerian weight w of a graph is hamiltonian if every faithful cover of w is a set of two Hamilton circuits. Let G be a 3-connected cubic graph containing no subdivision of the Petersen graph. We prove that if G admits a hamiltonian weight then G is uniquely 3-edge-colorable. © 1995 John Wiley & ...

متن کامل

Strong edge-coloring for cubic Halin graphs

A strong edge-coloring of a graph G is a function that assigns to each edge a color such that two edges within distance two apart must receive different colors. The minimum number of colors used in a strong edge-coloring is the strong chromatic index of G. Lih and Liu [14] proved that the strong chromatic index of a cubic Halin graph, other than two special graphs, is 6 or 7. It remains an open...

متن کامل

Interval edge-colorings of cubic graphs

An edge-coloring of a multigraph with colors 1, is called an interval coloring if all colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. In this paper we prove that if is a connected cubic multigraph (a connected cubic graph) that admits an interval coloring, then G 2, , t ... t −

متن کامل

Optimal acyclic edge-coloring of cubic graphs

? Users may download and print one copy of any publication from the public portal for the purpose of private study or research. ? You may not further distribute the material or use it for any profit-making activity or commercial gain ? You may freely distribute the URL identifying the publication in the public portal ? Take down policy If you believe that this document breaches copyright please...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2021

ISSN: ['1872-681X', '0012-365X']

DOI: https://doi.org/10.1016/j.disc.2021.112309